package 力扣._00周赛._426_周赛.问题1;

class Solution {
    public int smallestNumber(int n) {
        int t = 0;
        int i = 0;
        while (t < n) {
            t += (int) Math.pow(2, i++);
        }
        return t;
    }
}